Efficient Implicit Time-Marching Methods Using a Newton-Krylov Algorithm
نویسندگان
چکیده
The numerical behavior of two implicit time-marching methods is investigated in solving two-dimensional unsteady compressible flows. The two methods are the second-order multistep backward differencing formula and the fourth-order multistage explicit first stage, single-diagonal coefficient, diagonally implicit Runge-Kutta scheme. A Newton-Krylov method is used to solve the nonlinear problem arising from the implicit temporal discretization. The methods are studied for two test cases: laminar flow over a cylinder and turbulent flow over a NACA0012 airfoil with a blunt trailing edge. Parameter studies show that the subiteration termination criterion plays a major role in the efficiency of time-marching methods. Efficiency studies show that when only modest global accuracy is needed, the second-order method is preferred. The fourth-order method is more efficient when high accuracy is required. The Newton-Krylov method is seen to be an efficient choice for implicit time-accurate computations.
منابع مشابه
A parallel solution adaptive method for radiative heat transfer using a Newton-Krylov approach
The discrete ordinates method (DOM) and finitevolume method (FVM) are used extensively to solve the radiative transfer equation (RTE) in furnaces and combusting mixtures due to their balance between numerical efficiency and accuracy. These methods are typically solved using space-marching techniques since they converge rapidly for constant coefficient spatial discretization schemes and non-scat...
متن کاملFully implicit Lagrange-Newton-Krylov-Schwarz algorithms for boundary control of unsteady incompressible flows
We develop a parallel fully implicit domain decomposition algorithm for solving optimization problems constrained by time dependent nonlinear partial differential equations. In particular, we study the boundary control of unsteady incompressible Navier-Stokes equations. After an implicit discretization in time, a fully coupled sparse nonlinear optimization problem needs to be solved at each tim...
متن کاملA Fully Implicit Method for Lattice Boltzmann Equations
Existing approaches for solving the lattice Boltzmann equations with finite difference methods are explicit and semi-implicit; both have certain stability constraints on the time step size. In this work, a fully implicit second-order finite difference scheme is developed. We focus on a parallel, highly scalable, Newton–Krylov–RAS algorithm for the solution of a large sparse nonlinear system of ...
متن کاملScalability Studies of an Implicit Shallow Water Solver for the Rossby-Haurwitz Problem
The scalability of a fully implicit global shallow water solver is studied in this paper. In the solver a conservative second-order finite volume scheme is used to discretize the shallow water equations on a cubed-sphere mesh which is free of pole-singularities. Instead of using the popular explicit or semi-implicit methods in climate modeling, we employ a fully implicit method so that the rest...
متن کاملSemi-implicit Krylov deferred correction methods for differential algebraic equations
In the recently developed Krylov deferred correction (KDC) methods for differential algebraic equation initial value problems [33], a Picardtype collocation formulation is preconditioned using low-order time integration schemes based on spectral deferred correction (SDC), and the resulting system is solved efficiently using Newton-Krylov methods. KDC methods have the advantage that methods with...
متن کامل